Convolution Idempotents With a Given Zero-Set
نویسندگان
چکیده
منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملPermutations with given peak set
Let Sn denote the symmetric group of all permutations π = a1 . . . an of {1, . . . , n}. An index i is a peak of π if ai−1 < ai > ai+1 and we let P (π) be the set of peaks of π. Given any set S of positive integers we define P (S;n) to be the set π ∈ Sn with P (π) = S. Our main result is that for all fixed subsets of positive integers S and all sufficiently large n we have #P (S;n) = p(n)2n−#S−...
متن کاملdiameter two graphs of minimum order with given degree set
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
متن کاملFixed point belonging to the zero-set of a given function
We prove the existence and uniqueness of fixed point belonging to the zero-set of a given function. The results are established in the setting of metric spaces and partial metric spaces. Our approach combines the recent notions of (F,φ)contraction and Z-contraction. The main result allows to deduce, as a particular case, some of the most known results in the literature. An example supports the ...
متن کاملSpeeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic optimization problems. This class includes several variants of discrete stochastic shortest path, scheduling, and knapsack problems, all of which involve making a series of decisions over time that have stochastic con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2020
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2020.3016137